Online list coloring for signed graphs
نویسندگان
چکیده
We generalize the notion of online list coloring to signed graphs. define chromatic number a graph, and prove generalization Brooks' Theorem. also give necessary sufficient conditions for graph be degree paintable, or choosable. Finally, we classify 2-list-colorable 2-list-paintable
منابع مشابه
Coloring Signed Graphs
This survey paper provides an introduction to signed graphs, focusing on coloring. We shall introduce the concept of signed graphs, a proper coloring, and basic properties, such as a balanced graph and switchings. We will examine the chromatic number for six special signed graphs, upper bound the chromatic number, and discuss practical applications of signed graphs.
متن کاملColoring signed graphs using DFS
We show that depth first search can be used to give a proper coloring of connected signed graphs G using at most ∆(G) colors, provided G is different from a balanced complete graph, a balanced cycle of odd length, and an unbalanced cycle of even length, thus giving a new, short proof to the generalization of Brooks’ theorem to signed graphs, first proved by Máčajová, Raspaud, and Škoviera.
متن کاملList-coloring embedded graphs
For any fixed surface Σ of genus g, we give an algorithm to decide whether a graph G of girth at least five embedded in Σ is colorable from an assignment of lists of size three in time O(|V (G)|). Furthermore, we can allow a subgraph (of any size) with at most s components to be precolored, at the expense of increasing the time complexity of the algorithm to
متن کاملEquitable List Coloring of Graphs
A graph G is equitably k-choosable if, for any k-uniform list assignment L, G admits a proper coloring π such that π(v) ∈ L(v) for all v ∈ V (G) and each color appears on at most |G|/k vertices. It was conjectured in [8] that every graph G with maximum degree ∆ is equitably k-choosable whenever k ≥ ∆ + 1. We prove the conjecture for the following cases: (i) ∆ ≤ 3; (ii) k ≥ (∆ − 1). Moreover, eq...
متن کاملSum List Coloring Block Graphs
A graph is f -choosable if for every collection of lists with list sizes specified by f there is a proper coloring using colors from the lists. We characterize f -choosable functions for block graphs (graphs in which each block is a clique, including trees and line graphs of trees). The sum choice number is the minimum over all choosable functions f of the sum of the sizes in f . The sum choice...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebra and discrete mathematics
سال: 2022
ISSN: ['1726-3255', '2415-721X']
DOI: https://doi.org/10.12958/adm1806